A Product Version of Dynamic Linear Time Temporal Logic
نویسندگان
چکیده
منابع مشابه
A Product Version of Dynamic Linear Time Temporal Logic
We present here a linear time temporal logic which simultaneously extends LTL, the propositional temporal logic of linear time, along two dimensions. Firstly, the until operator is strengthened by indexing it with the regular programs of propositional dynamic logic (PDL). Secondly, the core formulas of the logic are decorated with names of sequential agents drawn from fixed finite set. The resu...
متن کاملDynamic Linear Time Temporal Logic
A simple extension of the propositional temporal logic of linear time is proposed. The extension consists of strengthening the until operator by indexing it with the regular programs of propositional dynamic logic (PDL). It is shown that DLTL, the resulting logic, is expressively equivalent to S1S, the monadic second-order theory of ω-sequences. In fact a sublogic of DLTL which corresponds to p...
متن کاملReasoning about Actions in Dynamic Linear Time Temporal Logic
In this paper we present a theory for reasoning about actions which is based on Dynamic Linear Time Temporal Logic (DLTL). DLTL is a simple extension of propositional temporal logic of linear time in which regular programs of propositional dynamic logic can be used for indexing temporal modalities. The action theory we define allows to reason with incomplete initial states, to do postdiction an...
متن کاملParametric Linear Dynamic Logic (full version)
We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear Dynamic Logic (LDL) by adding temporal operators equipped with parameters that bound their scope. LDL itself was proposed as an extension of Linear Temporal Logic (LTL) that is able to express all ω-regular specifications while still maintaining many of LTL’s desirable properties like intuitive syntax and semantics and a ...
متن کاملLinear Temporal Logic and Linear Dynamic Logic on Finite Traces
In this paper we look into the assumption of interpreting LTL over finite traces. In particular we show that LTLf , i.e., LTL under this assumption, is less expressive than what might appear at first sight, and that at essentially no computational cost one can make a significant increase in expressiveness while maintaining the same intuitiveness of LTLf interpreted over finite traces. Indeed, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1997
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v4i9.18800